Faces of faces of the tridiagonal Birkhoff polytope
نویسندگان
چکیده
منابع مشابه
Fibonacci numbers, alternating parity sequences and faces of the tridiagonal Birkhoff polytope
We determine the number of alternating parity sequences that are subsequences of an increasing m-tuple of integers. For this and other related counting problems we find formulas that are combinations of Fibonacci numbers. These results are applied to determine, among other things, the number of vertices of any face of the polytope of tridiagonal doubly stochastic matrices.
متن کاملMagic graphs and the faces of the Birkhoff polytope
ABSTRACT Magic labelings of graphs are studied in great detail by Stanley in [18] and [19], and Stewart in [20] and [21]. In this article, we construct and enumerate magic labelings of graphs using Hilbert bases of polyhedral cones and Ehrhart quasi-polynomials of polytopes. We define polytopes of magic labelings of graphs and digraphs. We give a description of the faces of the Birkhoff polytop...
متن کاملFaces of Birkhoff Polytopes
The Birkhoff polytope Bn is the convex hull of all (n×n) permutation matrices, i.e., matrices where precisely one entry in each row and column is one, and zeros at all other places. This is a widely studied polytope with various applications throughout mathematics. In this paper we study combinatorial types L of faces of a Birkhoff polytope. The Birkhoff dimension bd(L) of L is the smallest n s...
متن کاملKernel Polytope Faces Pursuit
Polytope Faces Pursuit (PFP) is a greedy algorithm that approximates the sparse solutions recovered by 1 regularised least-squares (Lasso) [4,10] in a similar vein to (Orthogonal) Matching Pursuit (OMP) [16]. The algorithm is based on the geometry of the polar polytope where at each step a basis function is chosen by finding the maximal vertex using a path-following method. The algorithmic comp...
متن کاملThe Number of Faces of a Simplicial Convex Polytope
Let P be a simplicial convex d-polytope with fi = fi(P) faces of dimension i. of integers was necessary and sufficient for f to be the f-vector of some simplicial convex d-polytope. Billera and Lee [l] proved the sufficiency of McMullen's condition. In this paper we prove necessity. Thus McMullen's conjecture is completely verified. First we describe McMullen's condition. Given a simplicial con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2010
ISSN: 0024-3795
DOI: 10.1016/j.laa.2009.10.030